A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
نویسندگان
چکیده
We present a polynomial time algorithm for the Minimum Quartet Inconsistency (MQI) problem when the number of quartet errors is O(n). This improves the previously best algorithmic result saying that if the number of quartet errors is at most (n− 3)/2 then the MQI problem can be solved in polynomial time. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
A randomized fixed-parameter algorithm for the minimum quartet inconsistency problem
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integer k as the parameter, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the p...
متن کاملA fixed-parameter algorithm for minimum quartet inconsistency
Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the Minimum Quartet Inconsistency (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. The more general problem where we are not necessarily given a topology for every subs...
متن کاملApproximating minimum quartet inconsistency (abstract)
A fundamental problem in computational biology which has been widely studied in the last decades is the reconstruction of evolutionary trees from biological data. Unfortunately, almost all its known formulations are NPhard. The compelling need for having efficient computational tools to solve this biological problem has brought a lot of attention to the analysis of the quartet paradigm for infe...
متن کاملEvaluating an Algorithm for Parameterized Minimum Quartet Inconsistency
MINIMUM QUARTET INCONSISTENCY (MQI) Input: A set S of n taxa and a set QS of quartet topologies such that there is exactly one topology for every quartet set corresponding to S, and an integer k. Question: Is there an evolutionary tree T where the leaves are bijectively labeled by the elements from S such that the set of quartet topologies induced by T differs from QS in at most k quartet topol...
متن کاملA Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
Inferring evolutionary trees has long been a challenging problem both for biologists and computer scientists. In recent years research has concentrated on the quartet method paradigm for inferring evolutionary trees. Quartet methods proceed by rst inferring the evolutionary history for every set of four species (resulting in a set Q of inferred quartet topologies) and then recombining these inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 100 شماره
صفحات -
تاریخ انتشار 2006